Diclib.com
Dicionário ChatGPT

Pesquisa de dicionário Soluções personalizadas

Digite uma palavra ou frase em qualquer idioma 👆

Idioma:

Tradução e análise de palavras por inteligência artificial ChatGPT

Nesta página você pode obter uma análise detalhada de uma palavra ou frase, produzida usando a melhor tecnologia de inteligência artificial até o momento:

como a palavra é usada
frequência de uso
é usado com mais frequência na fala oral ou escrita
opções de tradução de palavras
exemplos de uso (várias frases com tradução)
etimologia

O que (quem) é locally isomorphic - definição

Computably isomorphic

Locally convex topological vector space

TYPE OF TOPOLOGICAL VECTOR SPACE

Locally convex; Locally convex space; Locally convex spaces; Locally convex topology; Locally convex basis; Locally convex vector space; LCTVS; Finest locally convex topology

In functional analysis and related areas of mathematics, locally convex topological vector spaces (LCTVS) or locally convex spaces are examples of topological vector spaces (TVS) that generalize normed spaces. They can be defined as topological vector spaces whose topology is generated by translations of balanced, absorbent, convex sets.

https://en.wikipedia.org/wiki/Locally_convex_topological_vector_space

Semi-locally simply connected

In mathematics, specifically algebraic topology, semi-locally simply connected is a certain local connectedness condition that arises in the theory of covering spaces. Roughly speaking, a topological space X is semi-locally simply connected if there is a lower bound on the sizes of the “holes” in X.

https://en.wikipedia.org/wiki/Semi-locally_simply_connected

Locally nilpotent

In the mathematical field of commutative algebra, an ideal I in a commutative ring A is locally nilpotent at a prime ideal p if Ip, the localization of I at p, is a nilpotent ideal in Ap.

https://en.wikipedia.org/wiki/Locally_nilpotent

Wikipédia

Computable isomorphism

In computability theory two sets $A;B\subseteq \mathbb {N}$ of natural numbers are computably isomorphic or recursively isomorphic if there exists a total bijective computable function $f\colon \mathbb {N} \to \mathbb {N}$ with $f(A)=B$ . By the Myhill isomorphism theorem, the relation of computable isomorphism coincides with the relation of mutual one-one reducibility.

Two numberings $\nu$ and $\mu$ are called computably isomorphic if there exists a computable bijection $f$ so that $\nu =\mu \circ f$

Computably isomorphic numberings induce the same notion of computability on a set.

https://en.wikipedia.org/wiki/Computable isomorphism